Description: 图的操作,包括,图的基本存储方法,有关图的操作算法并用C语言编程实现,图的搜索路径的遍历方法,以邻接矩阵和邻接表的方式存储连通图。然后分别用优先深度算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。深度优先遍历的递归算法 （1）深度优先遍历算法（2）邻接表表示的深度优先搜索算法（3）邻接矩阵表示的深度优先搜索算法.-plan of operation, including, map the basic storage methods, the operation of the map algorithm and C language programming. map of the search path traversal methods to the adjacency matrix and adjacency list of storage connected graph. Then, using the priority traversal algorithm depth of the matrix adjacent to the storage map and the adjacent forms storage plans. Depth-first traversal of the recursive algorithm (1) depth-first traversal algorithm (2) adjoining table depth-first search algorithm ( 3) adjacency matrix of depth-first search algorithm. Platform: |
Size: 1024 |
Author:林静 |
Hits:
Description: 用邻接表实现个图的存储，在VISUAL C++环境中实现-Realize using adjacency list of graph storage, in VISUAL C++ Environment Platform: |
Size: 1024 |
Author:pallas |
Hits:
Description: 图的建立，图的广度优先遍历，深度优先遍历，邻接表等，c语言-Chart the establishment of the breadth-first graph traversal, depth-first traversal, such as adjacency list, c language Platform: |
Size: 4096 |
Author:杨飞 |
Hits:
Description: 实现了图的主要操作:（1）分别用邻接矩阵和邻接表实现图的基本操作（包括图的广度和深度优先搜索）；(2）判断该图是否连通，输出该图的连通分量数目；（3）输出一个每一个连通分量的最小生成树。-The main achievement of the plan steps: (1), respectively, with adjacency matrix and adjacency list to achieve the basic map operations (including map the breadth and depth-first search) (2) to determine whether the connectivity of the graph, the output of the graph the number of connected components (3) the output of a connected component of every minimum spanning tree. Platform: |
Size: 20480 |
Author:李雅芳 |
Hits:
Description: 图可以采用邻接矩阵、邻接表等多种方式存储，本程序实现图的邻接表存储-Chart can be used adjacency matrix, adjacency list a variety of ways, such as storage, this procedure realize Graph Adjacency List Storage Platform: |
Size: 1024 |
Author:youjing |
Hits:
Description: 图的算法实现
（1）将图的信息建立文件；
（2）从文件读入图的信息，建立邻接矩阵和邻接表；
（3）实现Prim、Kruskal、Dijkstra和拓扑排序算法。
-Graph Algorithms (1) will map the information to create the document (2) read from the document map information, the establishment of adjacency matrix and adjacency list (3) the realization of Prim, Kruskal, Dijkstra, and topological sorting algorithm. Platform: |
Size: 105472 |
Author:陈阳 |
Hits:
Description: 设计邻接表类,实现无向图的深度优先非递归遍历,无向图的广度优先遍历,并设计主函数输入数据进行测试-Design category adjacency list, realize undirected graph of the depth-first traversal non-recursive, non-directed graph breadth-first traversal, and the design of the main function of the input data for testing Platform: |
Size: 1383424 |
Author:lindaoming |
Hits:
Description: 图的各种存储结构，特别要熟练掌握邻接矩阵和邻接表存储结构。
遍历是图各种应用的算法的基础，要熟练掌握图的深度优先遍历-Map a variety of storage structures, in particular to master the adjacency matrix and adjacency list storage structure. Graph traversal is a wide range of applications based on algorithms, it is necessary to master the graph depth-first traversal Platform: |
Size: 1024 |
Author:fan |
Hits:
Description: 图的邻接表存储表示法 源码 这是进行计算机图论算法的基础 如最基本算法DFS BFS
图的邻接表存储表示法 源码 这是进行计算机图论算法的基础 如最基本算法DFS BFS-Adjacency list graph representation of source storage This is a computer algorithm based on graph theory such as the basic algorithm DFS BFS graph adjacency list representation storage source This is a computer algorithm based on graph theory such as the basic algorithm DFS BFS Platform: |
Size: 880640 |
Author:cuiyuzheng |
Hits:
Description: 图的邻接链表及遍历及基本操作，节点的插入删除等基本操作，适合初级算法学习者-Adjacency list graph and traversal and basic operations, insertion node to delete such basic operations, suitable for primary algorithm learners Platform: |
Size: 158720 |
Author:cscaoshang |
Hits:
Description: Specification File
adjacencyListGragh
class GeneralGraph:
use adjacency list to implement the graph which data structure is vector
Construct methods:
* public GeneralGraph():
contain an empty vector store the vertex and a boolean determines whether graph is directed or not, defaulted is undirected Platform: |
Size: 9216 |
Author:荆江 |
Hits:
Description: 图： 调试图的邻接链表存储的程序，解决下列问题：
根据教科书P157页的G2图（无向图），输入数据运行程序；再适当修改程序使它适用于G1图（有向图），输入数据运行程序。-Adjacency list graph debug stored procedures, to address the following issues: According to the textbook page G2 Fig P157 (undirected graph), input data to run programs modify the program so that it no longer appropriate for G1 plan (directed graph), input data run the program. Platform: |
Size: 107520 |
Author:奈奈 |
Hits:
Description: 图基于邻接表的创建以及深度优先遍历和广度优先遍历-Graph based on adjacency list creation, as well as depth-first traversal and breadth-first traversal
Platform: |
Size: 239616 |
Author:欧阳云飞 |
Hits:
Description: Description:
采用邻接表表示有向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列，边的输入按照边的顶点序号从小到大的顺序排列，如下图的边的输入顺序为0 1，0 2，0 3，1 2，1 3，2 4，3 4共七条边，邻接表的边结点采用头插法。本输入样例中所用的图如下所示：
Input Format:
第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数
第二行输入各顶点的信息，即输入每个顶点字符
第三行开始输入每条边，每条边的形式为两个顶点的序号，中间以空格隔开，输入完一条边换行
Output format:
首先输出图的顶点信息，输出完毕换行
接着输出图的邻接表，格式为首先输出第一个顶点，接着输出该顶点的所有的临界点的序号，换行，然后输出下一个顶点及邻接点，以此类推
接下来一行输出从图的第一个顶点开始进行深度优先遍历的序列，中间以空格隔开，输出完毕换行
最后一行输出从图的第一个顶点开始进行广度优先遍历的序列，中间以空格隔开，输出完毕换行
-Description:
Adjacency list using said directed graph to complete the map creation, map of the depth-first traversal, breadth-first graph traversal operations. In which vertex information is character, the graph vertices in order arranged by character number, while the input side of the vertex according to serial number from small to large order, the following graph of the input side of the order of 0 1,0 2,0 3,1 2,1 3,2 4,3 4 a total of seven edge, the edge-node adjacency list using the first interpolation. The input sample used in the diagram are as follows:
Input Format:
The first line of input two values, the first one is the number of graph vertices, the second one is the number of graph edges
Second row, enter information in each vertex, that enter each vertex character
Start typing in the third line of each side, each side in the form of two vertices of the serial number, in the middle separated by a space, enter the End of an edge wrap
Output format:
First, the Platform: |
Size: 2048 |
Author:kernel |
Hits:
Description: 1、在文本文件中按照一定的格式存储图的数据
2、从文件中读入该信息，并且构造两种存储方式
3、输出两种存储方式，并进行转化，看是否得到了正确的结果
4、在邻接表的基础上实现图的遍历操作
5、编写图的最小生成树算法，并进行验证
6、编写最短路径算法，并对输入的图进行验证
-1, in a text file format according to certain data stored in Figure 2, read from the file of the information, and construct two storage mode 3, the output two storage methods, and converted to see the results of the correct 4 in the adjacency list graph traversal based on the operation of 5, prepared for the minimal spanning tree algorithm, and validated 6, the preparation of the shortest path algorithm, and validate the input graph Platform: |
Size: 5120 |
Author:mehope |
Hits:
Description: 有向图 采用邻接表存储 DFS和BFS方法遍历 为方便表示,结点数小于10 用V0-V9表示不同的结点的-Directed graph using adjacency list method of storing DFS and BFS traversal for the convenience that the number of nodes is less than 10 with V0-V9 for different node Platform: |
Size: 2048 |
Author:刘少东 |
Hits:
Description: 基于邻接表表示的图的遍历包括深度优先遍历和广度优先遍历-Based on the adjacency list representation of the graph traversal, including the depth-first and breadth-first traversal Platform: |
Size: 2048 |
Author:hu |
Hits:
Search - adjacency list graph